Automatic Face Recognition System using P-tree and K-Nearest Neighbor Classifier
نویسندگان
چکیده
Face recognition has recently received remarkable attention in both authentication and identification systems due to high acceptability and collectability, regardless its lower circumvention and uniqueness than other biometric verification technologies. The basic approach with face recognition commences with feature set construction from the relevant facial traits of the users, termed enrollment [1]. When a user is to be authenticated (i.e. the user's identity is to be verified), his/her facial sample is captured and a feature set is created. This feature set is then compared with the enrollment feature set. But feature set search mechanism is time consuming and sometimes exhaustive. In this paper, a very efficient and time saving search mechanism is proposed that exploits the advantages of Peano Count Tree and KNearest Neighbor Search techniques.
منابع مشابه
Fault Detection and Classification in Double-Circuit Transmission Line in Presence of TCSC Using Hybrid Intelligent Method
In this paper, an effective method for fault detection and classification in a double-circuit transmission line compensated with TCSC is proposed. The mutual coupling of parallel transmission lines and presence of TCSC affect the frequency content of the input signal of a distance relay and hence fault detection and fault classification face some challenges. One of the most effective methods fo...
متن کاملEfficient K-Nearest Neighbor Searches for Multiple-Face Recognition in the Classroom based on Three Levels DWT-PCA
The main weakness of the k-Nearest Neighbor algorithm in face recognition is calculating the distance and sort all training data on each prediction which can be slow if there are a large number of training instances. This problem can be solved by utilizing the priority k-d tree search to speed up the process of k-NN classification. This paper proposes a method for student attendance systems in ...
متن کاملFace Recognition Using Legendre Moments
The wide range of variations in human face due to view point, pose, illumination and expression deteriorate the recognition performance of the existing Face recognition systems. This paper proposes a new approach to face recognition problem using Legendre moments for representing features and nearest neighbor classifier for classification. The Legendre moments are orthogonal and scale invariant...
متن کاملA New Attempt to Face Recognition Using 3d Eigenfaces
Face recognition is a very challenging issue and has attracted much attention over the past decades. This paper makes a new attempt to face recognition based on 3D point clouds by constructing 3D eigenfaces. First, a 3D mesh model is built to represent the face shape provided by the point cloud. Then, the principle component analysis (PCA) is used to construct the 3D eigenfaces, which describe ...
متن کاملLazy Classifiers Using P-trees
Lazy classifiers store all of the training samples and do not build a classifier until a new sample needs to be classified. It differs from eager classifiers, such as decision tree induction, which build a general model (such as a decision tree) before receiving new samples. K-nearest neighbor (KNN) classification is a typical lazy classifier. Given a set of training data, a knearest neighbor c...
متن کامل